منابع مشابه
Parallel algorithms for Hamiltonian problems on quasi-threshold graphs
In this paper we show structural and algorithmic properties on the class of quasi-threshold graphs, or QT-graphs for short, and prove necessary and sufficient conditions for a QT-graph to be Hamiltonian. Based on these properties and conditions, we construct an efficient parallel algorithm for finding a Hamiltonian cycle in a QT-graph; for an input graph on n vertices and m edges, our algorithm...
متن کاملHamiltonian powers in threshold and arborescent comparability graphs
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give efficient algorithms as well as sufficient and minimax toughness like conditions. For arborescent comparability graphs we have similar results but also show that for one type of completion problem an ‘obvious’ minimax condi...
متن کاملHamiltonian Factors in Hamiltonian Graphs
Let G be a Hamiltonian graph. A factor F of G is called a Hamiltonian factor if F contains a Hamiltonian cycle. In this paper, two sufficient conditions are given, which are two neighborhood conditions for a Hamiltonian graph G to have a Hamiltonian factor. Keywords—graph, neighborhood, factor, Hamiltonian factor.
متن کاملHamiltonian strongly regular graphs
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected nonHamiltonian strongly regular graph on fewer than 99 vertices.
متن کامل2-Factor hamiltonian graphs
The Heawood graph and K3;3 have the property that all of their 2-factors are Hamilton circuits. We call such graphs 2-factor hamiltonian. We prove that if G is a k-regular bipartite 2factor hamiltonian graph then either G is a circuit or k 1⁄4 3: Furthermore, we construct an infinite family of cubic bipartite 2-factor hamiltonian graphs based on the Heawood graph and K3;3 and conjecture that th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1987
ISSN: 0166-218X
DOI: 10.1016/0166-218x(87)90050-3